Non-axiomatizability for the linear temporal logic of knowledge with concrete observability
نویسنده
چکیده
We show that propositional linear temporal logic with knowledge modalities but without common knowledge has an undecidable satisfiability problem when interpreted in a ‘concrete’ semantics with perfect recall or with perfect recall and synchrony. We then conclude that this concrete semantics is not axiomatizable in the semantics, based on local states.
منابع مشابه
Diagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملReasoning about Strategies under Partial Observability and Fairness Constraints
A number of extensions exist for Alternating-time Temporal Logic; some of these mix strategies and partial observability but, to the best of our knowledge, no work provides a unified framework for strategies, partial observability and fairness constraints. In this paper we propose ATLKF po, a logic mixing strategies under partial observability and epistemic properties of agents in a system with...
متن کاملFinite LTL Synthesis is EXPTIME-complete
LTL synthesis – the construction of a function to satisfy a logical specification formulated in Linear Temporal Logic – is a 2EXPTIME-complete problem with relevant applications in controller synthesis and a myriad of artificial intelligence applications. In this research note we consider De Giacomo and Vardi’s variant of the synthesis problem for LTL formulas interpreted over finite rather tha...
متن کاملLinear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility
The paper studies problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent’s knowledge in non-transitive temporal linear logic LTLPast,m. We find algorithms solving mentioned problems, justify our approach to consider linear non-transitive time with several examples. Main, most complicated, technical new result is it decidability of LTLPa...
متن کاملAnalysis of Thin-Walled Steel Sections Filled with Concrete Using Non-Linear Finite Element Method
Being economical and performing well under cyclic loads, steel sections filled with concrete have been widely used in structural buildings. Extensive studies and experiments have been conducted to investigate the influence of different parameters and loadings on the behavior of these structural components. Based on the data available from previous experiments and studies, this paper discusses t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 21 شماره
صفحات -
تاریخ انتشار 2011